The Point-Descriptor-Precedence representation for point configurations and movements
نویسندگان
چکیده
In this paper, we represent (moving) point configurations along a curved directed line qualitatively by means of system relational symbols based on two distance descriptors: one representing the and other signed orthogonal to line. The represents direction movement interest. For instance, it could be straight as in case driving highway or an intersection roundabout. Inspired Point Calculus, order between points is described small set binary relations (<,=,>) acting upon descriptors. We call representation Point-Descriptor-Precedence-Static (PDPS) at time Point-Descriptor-Precedence-Dynamic (PDPD) during interval. To illustrate how proposed approach can used analyse movements, some basic micro-analysis traffic examples are studied. Finally, discuss extensions our work highlight practical benefits PDP identifying motion patterns that useful GIS, autonomous vehicles, sports analytics, gait analysis.
منابع مشابه
Subquadratic Encodings for Point Configurations
For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation of each triple of points in the set (clockwise, counterclockwise, or collinear). This information is called the order type of the point set. In the dual, realizable order types and abstract order types are combinatoria...
متن کاملThe complexity of point configurations
Goodman, J.E. and R. Pollack, The complexity of point configurations, Discrete Applied Mathematics 31 (1991) 167-180. There are several natural ways to extend the notion of the order of points on a line to higher dimensions. This article focuses on three of them-combinatorial type, order type, and isotopy class-and surveys work done in recent years on the efficient encoding of order types and o...
متن کاملOn Matching Point Configurations
We present an algorithm that verifies if two unlabeled configurations of N points in Rd are or are not an orthogonal transformation of one another, and if applicable, explicitly compute that transformation. We also give a formula for the orthogonal transformation in the case of noisy measurements. AMS subject classification: 65F15, 65F35, 65G99.
متن کامل1 Finite Point Configurations
The study of combinatorial properties of finite point configurations is a vast area of research in geometry, whose origins go back at least to the ancient Greeks. Since it includes virtually all problems starting with “consider a set of n points in space,” space limitations impose the necessity of making choices. As a result, we will restrict our attention to Euclidean spaces and will discuss p...
متن کاملInitial Configurations for OSPF over a Point−to−Point Link
Introduction Prerequisites Requirements Components Used Conventions OSPF over a Point−to−Point Link with IP Addresses on Serial Interfaces Network Diagram Configurations OSPF over a Point−to−Point Link with Unnumbered Interfaces Network Diagram Configurations Verify Verify the Configuration of OSPF with IP Addresses on Serial Interfaces Verify the Configuration of OSPF with Unnumbered Interface...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geographical Information Science
سال: 2021
ISSN: ['1365-8824', '1365-8816']
DOI: https://doi.org/10.1080/13658816.2020.1864378